Graph matching for reconciling SCADA and GIS of a distribution network

摘要

This article deals with the problem of automatically es- tablishing a correspondence between two databases popu- lated independently over the years by a distribution com- pany, for instance a SCADA system and a geographical information system. This problem is abstracted as a graph matching problem, well known in the combinatorial op- timisation community. It is then casted as an integer quadratic program. An idea of achievable results on a real system is provided, and needs for approximation or decom- position algorithms are discussed.